Parallel Decomposition of Generalized Series-Parallel Graphs
نویسندگان
چکیده
Received July 17, 1997; accepted May 1, 1998. Communicated by Wen-Lian Hsu. *A preliminary version of this paper appeared in the proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’97) Las Vegas, Nevada, pp. 890-896, 1997. Research supported in part by NSC under Grant 83-0408-E-008-004. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 15, 407-417 (1999)
منابع مشابه
Stochastic Comparisons of Series and Parallel Systems with Heterogeneous Extended Generalized Exponential Components
In this paper, we discuss the usual stochastic‎, ‎likelihood ratio, ‎dispersive and convex transform order between two parallel systems with independent heterogeneous extended generalized exponential components. ‎We also establish the usual stochastic order between series systems from two independent heterogeneous extended generalized exponential samples. ‎Finally, ‎we f...
متن کاملA Novel Generalized Topology for Multi-level Inverter with Switched Series-parallel DC Sources (RESEARCH NOTE)
This paper presents a novel topology of single-phase multilevel inverter for low and high power applications. It consists of polarity (Level) generation circuit and H Bridge. The proposed topology can produce higher output voltage levels by connecting dc voltage sources in series and parallel. The proposed topology utilizes minimum number of power electronic devices which helps in reduction o...
متن کاملThe Uniform Generalized Decomposition Method for Generating Algebraic Expressions of Fibonacci Graphs
The paper investigates relationship between algebraic expressions and Fibonacci graphs (which give a generic example of non-series-parallel graphs). We propose the uniform generalized decomposition method for constructing Fibonacci graph expressions. On every step this method divides the graph of size n into k parts of the same size. We prove that to reach the smallest possible length of the co...
متن کاملParallel Algorithms for Series Parallel Graphs
In this paper, a parallel algorithm is given that, given a graph G = (V;E), decides whether G is a series parallel graph, and if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log jEj log jEj) time and O(jEj) operations on an EREW PRAM, and O(log jEj) time and O(jEj) operations on a CRCW PRAM (note that ifG is a simple series parallel graph,...
متن کاملSpace Efficient Algorithms for Series-Parallel Graphs
The subclass of directed series-parallel graphs plays an important role in computer science. To determine whether a graph is series-parallel is a well studied problem in algorithmic graph theory. Fast sequential and parallel algorithms for this problem have been developed in a sequence of papers. For series-parallel graphs methods are also known to solve the reachability and the decomposition p...
متن کاملBounds on circular consecutive choosability
The circular consecutive choosability chcc(G) of a graph G has been recently introduced in [2]. In this paper we prove upper bounds on chcc for series-parallel graphs, planar graphs and k-choosable graphs. Our bounds are tight for classes of series-parallel graphs and k-choosable graphs for k ≥ 3. Then we study the circular consecutive choosability of generalized theta graphs. Lower bounds for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 15 شماره
صفحات -
تاریخ انتشار 1997